On the Complexity of Learning with a Small Number of Nodes
نویسنده
چکیده
It is shown that the loading problem for a 6 node neural network with node function set AC1 (that is, the conjunction or disjunction of a subset of the inputs or their complements) is NP complete. It can be deduced from this observation that the loading problem for a 6 node analog neural network is NP hard.
منابع مشابه
Sentinel Node Mapping in Non-small Cell Lung Cancer Using an Intraoperative Radiotracer Technique
Objective(s): Lymph node metastases are the most significant prognostic factor in localized non-small cell lung cancer (NSCLC). Identification of the first nodal drainage site (sentinel node) may improve detection of metastatic nodes. Extended surgeries, such as lobectomy or pneumonectomy with lymph node dissection, are among the therapeutic options of higher acceptab...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملAn Optimized Firefly Algorithm based on Cellular Learning Automata for Community Detection in Social Networks
The structure of the community is one of the important features of social networks. A community is a sub graph which nodes have a lot of connections to nodes of inside the community and have very few connections to nodes of outside the community. The objective of community detection is to separate groups or communities that are linked more closely. In fact, community detection is the clustering...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملCommunity Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
متن کاملDifferent Task Complexity Factors and Cognitive Individual Differences: The Effects on EFL Writers’ Performance
This study aimed at examining the main and interaction effects of increased intentional reasoning demands, planning time, and also language learning aptitude on syntactic complexity, accuracy, lexical complexity, and fluency (CALF) of 226 EFL learners’ performance on letter writing tasks. The participants were first randomly assigned to three experimental groups to be given a task with differin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992